Synchronization on star graph with noise
نویسندگان
چکیده
We investigate synchronization in the Kuramoto model with noise on a star graph. By revising case of complete graph, we propose closed form self-consistency equation for conventional order parameter and generalize it Using obtained equation, demonstrate that there is crossover between abrupt at small continuous phase transition quite large noise. probe this numerically analytically.
منابع مشابه
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes. However, the distance measure cannot be applied on star graphs directly, since there are many routing path patterns when the distances of two pairs of nodes are the same. Thus, on star graphs, we define the safety ve...
متن کاملMatrix Decomposition on the Star Graph
—We present and evaluate, for the first time, a parallel algorithm for solving the LU decomposition problem on the star graph. The proposed parallel algorithm is of O(N 3 /n!) computation complexity and uses O(Nn) communication time to decompose a matrix of order N on a star graph of dimension n, where N ≥ (n-1)!. The incurred communication time is better than the best known results for the hyp...
متن کاملOn the genus of the star graph
The star graph S n is a graph with S n the set of all permutations over f1; : : :; ng as its vertex set; two vertices 1 and 2 are connected if 1 can be obtained form 2 by swapping the rst element of 1 with one of the other n ? 1 elements. In this paper we establish the genus of the star graph. We show that the genus, g n of S n , is exactly equal to n!(n?4)=6+1 by establishing a lower bound and...
متن کاملParallel Clustering on the Star Graph
In this paper, a parallel algorithm for data clustering is presented on a multi-computer with star topology. This algorithm is fast and requires a small amount of memory per processing element, which makes it even suitable for SIMD implementation. The proposed parallel algorithm completes in O(K+S T) steps for a clustering problem of N data patterns with M features per pattern and K clusters, w...
متن کاملBroadcasting on Incomplete Star Graph Interconnection Networks
In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete star graphs. A n incomplete star graph with N nodes, where (n l ) ! < N < n! , is a subgraph of an n-star. Using a routing scheme to transmit a message to each substar composed of the incomplete star, our proposed broadcasting algorithm is optimal in O(n1ogn) on the single-port communication model. While broa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos Solitons & Fractals
سال: 2023
ISSN: ['1873-2887', '0960-0779']
DOI: https://doi.org/10.1016/j.chaos.2022.113056